// Definition for singly-linked list.
#[derive(PartialEq, Eq, Clone, Debug)]
pub struct ListNode {
  pub val: i32,
  pub next: Option<Box<ListNode>>
}

impl ListNode {
  #[inline]
  fn new(val: i32) -> Self {
    ListNode {
      next: None,
      val
    }
  }
}
pub fn modified_list(nums: Vec<i32>, head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
    let mut nt = nums.clone();
    nt.sort();
    head
}


fn find(nums: &Vec<i32>, i:i32)-> bool{
    let mut s = 0_usize;
    let mut e = nums.len()-1;
    while s <= e {
        let m = (s+e)/2;
        if nums[m] == i {
            return true;
        } else if nums[m] > i {
            e = m-1;
        }else {
            s = m+1;
        }
    }
    false
}


#[cfg(test)]
mod test{

}